1·Simplex algorithm is an effective method for solving linear programming problem.
单纯形法是求解线性规划问题的有效方法。
2·In this paper, we introduce two strategies to modify Nelder-Mead simplex algorithm.
本文提出单纯形置换算法的改进策略。
3·The empirical genetic-simplex algorithm is one of the effective method to solve the problem.
经验遗传-单纯形算法正是解决这一问题的一种有效方法。
4·It has more advantages than primal simplex algorithm, two-stage simplex algorithm and dual simplex algorithm.
它比原始单纯形法、两阶段单纯形法、对偶单纯形法具有更大的优越性。
5·In 1947, George Dantzig developed an efficient method, the simplex algorithm, for solving linear programming problems.
在1947年，George Dantzig开发了一种效率方法——simplex算法——来解决线性编程的问题。
6·To solve a linear programming with the dual simplex algorithm, it is necessary to find a primal regular solution.
在用对偶单纯形法解线性规划问题时，必须找到初始正则解。
7·Thus, we propose a hybrid Immune algorithm (IA) based heuristic containing a simplex algorithm as a sub-search process.
为此，本文提出用一个基于模型特性，包含子搜索过程的混合免疫算法来对问题进行优化。
8·The answer is in the algebra behind the simplex algorithm, but explaining how it works is beyond the scope of this article.
答案要看 simplex 算法背后采用的代数关系，但是有关它是如何工作的解释已经超出了本文的范围。
9·The paper presents a new algorithm which is named Generalized Simplex Algorithm. It is an extended algorithm of the Simplex Algorithm.
提出了一个新算法，取名为广义单纯形算法，它可被看作是单纯形法的扩展算法。
10·This paper makes improvement on the criterion of choosing basic variable in simplex algorithm and gives out a new selecting criterion.
本文就单纯形算法选取入基变量的准则进行改进，给出一种新的选取入基变量的准则。